Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance
نویسندگان
چکیده
We introduce a new O(lg lgn)-competitive binary search tree data structure called poketree that has the advantage of attaining, under worst-case analysis, O(lg n) cost per operation, including updates. Previous O(lg lgn)-competitive binary search tree data structures have not achieved O(lg n) worst-case cost per operation. A standard data structure such as red-black tree or deterministic skip list can be augmented with the dynamic links of a poketree to make it O(lg lgn)-competitive. Our approach also uses less memory per node than previous competitive data structures supporting updates.
منابع مشابه
Experimental evaluation of local heaps
In this paper we present a cache-aware realization of a priority queue, named a local heap, which is a slight modification of a standard binary heap. The new data structure is cache efficient, has a small computational overhead, and achieves a good worst-case performance with respect to the number of element comparisons and the number of element moves. We show both theoretically and experimenta...
متن کاملAll-Around Near-Optimal Solutions for the Online Bin Packing Problem
In this paper we present algorithms with optimal average-case and close-to-best known worst-case performance for the classic online bin packing problem. It has long been observed that known bin packing algorithms with optimal average-case performance are not optimal in the worst-case. In particular First Fit and Best Fit have optimal asymptotic average-case ratio of 1 but a worstcase competitiv...
متن کاملAn Integrated Approach for Measuring Performance of Network structure: Case study on power plants
Data envelopment analysis (DEA) and balanced scorecard (BSC) are two well-known approaches for measuring performance of decision making units (DMUs). BSC is especially applied with quality measures, whereas, when the quantity measures are used to evaluate, DEA is more appropriate. In the real-world, DMUs usually have complex structures such as network structures. One of the well-known network s...
متن کاملCS264: Beyond Worst-Case Analysis Lecture #3: Online Paging and Resource Augmentation
This course covers many different methods of analyzing and comparing algorithms. Periodically, as in Section 2, we pause to review the “big picture” and suggest methods for keeping tracking of the course’s main ideas, their goals, and the problems for which they are most likely to be useful. Section 3 begins our study of the online paging problem — introduced briefly in Lecture #1 — we’ll also ...
متن کاملAn Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems
We consider the classical power management problem: There is a device which has two states ON and OFF and one has to develop a control algorithm for changing between these states as to minimize (energy) cost when given a sequence of service requests. Although an optimal 2-competitive algorithm exists, that algorithm does not have good performance in many practical situations, especially in case...
متن کامل